package com.sicheng.lc.周赛.分类.dfs记忆化;

/**
 * @author zsc
 * @version 1.0
 * @date 2022/6/22 19:25
 */
public class 相邻字符不同的最长路径 {
    //https://leetcode.cn/problems/longest-path-with-different-adjacent-characters/




    public int longestPath(int[] parent, String s) {

        return -1;
    }

    public static void main(String[] args) {
        相邻字符不同的最长路径 solution = new 相邻字符不同的最长路径();
        int[] parent = {-1, 0, 0, 0};
        String s = "aabc";
        System.out.println(solution.longestPath(parent, s));
    }
}
